Search results for "Symmetric function"

showing 10 items of 13 documents

Double point curves for corank 2 map germs from C2 to C3

2012

Abstract We characterize finite determinacy of map germs f : ( C 2 , 0 ) → ( C 3 , 0 ) in terms of the Milnor number μ ( D ( f ) ) of the double point curve D ( f ) in ( C 2 , 0 ) and we provide an explicit description of the double point scheme in terms of elementary symmetric functions. Also we prove that the Whitney equisingularity of 1-parameter families of map germs f t : ( C 2 , 0 ) → ( C 3 , 0 ) is equivalent to the constancy of both μ ( D ( f t ) ) and μ ( f t ( C 2 ) ∩ H ) with respect to t , where H ⊂ C 3 is a generic plane.

AlgebraSymmetric functionPure mathematicsDouble pointPlane (geometry)Scheme (mathematics)Geometry and TopologyMilnor numberMathematicsTopology and its Applications
researchProduct

Degrees of irreducible characters of the symmetric group and exponential growth

2015

We consider sequences of degrees of ordinary irreducible S n S_n - characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of n n with leading coefficient less than one. We show that any such sequence has at least exponential growth and we compute an explicit bound.

CharacterPower sum symmetric polynomialGeneral MathematicsApplied MathematicsMathematicsofComputing_GENERALComplete homogeneous symmetric polynomialExponential polynomialExponential growthCombinatoricsRepresentation theory of the symmetric groupSymmetric groupElementary symmetric polynomialMathematics (all)Ring of symmetric functionsCharacter groupSymmetric groupMathematics
researchProduct

Computing with Rational Symmetric Functions and Applications to Invariant Theory and PI-algebras

2012

The research of the first named author was partially supported by INdAM. The research of the second, third, and fourth named authors was partially supported by Grant for Bilateral Scientific Cooperation between Bulgaria and Ukraine. The research of the fifth named author was partially supported by NSF Grant DMS-1016086.

Classical Invariant Theory05A15 05E05 05E10 13A50 15A72 16R10 16R30 20G05MacMahon Partition AnalysisHilbert SeriesRational symmetric functions classical invariant theory algebras with polynomial identity cocharacter sequenceMathematics - Rings and AlgebrasCommutative Algebra (math.AC)Mathematics - Commutative AlgebraRational Symmetric FunctionsAlgebras with Polynomial IdentitySettore MAT/02 - AlgebraRings and Algebras (math.RA)Noncommutative Invariant TheoryFOS: MathematicsCocharacter SequenceMathematics - CombinatoricsCombinatorics (math.CO)
researchProduct

Explicit expressions for totally symmetric spherical functions and symmetry-dependent properties of multipoles

2014

Closed expressions for matrix elements 〈 lm' | A (G)| lm 〉, where | lm 〉 are spherical functions and A (G) is the average of all symmetry operators of point group G, are derived for all point groups (PGs) and then used to obtain linear combinations of spherical functions that are totally symmetric under all symmetry operations of G. In the derivation, we exploit the product structure of the groups. The obtained expressions are used to explore properties of multipoles of symmetric charge distributions. We produce complete lists of selection rules for multipoles Q l and their moments Q lm , as well as of numbers of independent moments in a multipole, for any l and m and for all PGs. Periodic…

CombinatoricsSymmetric functionMatrix (mathematics)Group (mathematics)General MathematicsGeneral EngineeringGeneral Physics and AstronomyPoint (geometry)Point groupMultipole expansionSymmetry (physics)Mathematical physicsMathematicsProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
researchProduct

Understanding Quantum Algorithms via Query Complexity

2017

Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes. Query complexity is widely used for studying quantum algorithms, for two reasons. First, it includes many of the known quantum algorithms (including Grover's quantum search and a key subroutine of Shor's factoring algorithm). Second, one can prove lower bounds on the query complexity, bounding the possible quantum advantage. In the last few years, there have been major advances on several longstanding problems in the query complexity. In this talk, we su…

Discrete mathematicsFOS: Computer and information sciencesQuantum PhysicsComputer scienceModel of computationSubroutineComputer Science::Information RetrievalFOS: Physical sciencesFunction (mathematics)Computational Complexity (cs.CC)Symmetric functionComputer Science - Computational ComplexityBounding overwatchPartial functionKey (cryptography)Quantum algorithmQuantum Physics (quant-ph)Computer Science::Databases
researchProduct

2-SYMMETRIC CRITICAL POINT THEOREMS FOR NON-DIFFERENTIABLE FUNCTIONS

2008

AbstractIn this paper, some min–max theorems for even andC1functionals established by Ghoussoub are extended to the case of functionals that are the sum of a locally Lipschitz continuous, even term and a convex, proper, lower semi-continuous, even function. A class of non-smooth functionals admitting an unbounded sequence of critical values is also pointed out.

Discrete mathematicsNon-smooth critical point theory minmax theorems symmetric functionsGeneral MathematicsRegular polygonEven and odd functionsDifferentiable functionLipschitz continuityCritical point (mathematics)MathematicsGlasgow Mathematical Journal
researchProduct

The convolution operation on the spectra of algebras of symmetric analytic functions

2012

Abstract We show that the spectrum of the algebra of bounded symmetric analytic functions on l p , 1 ≤ p + ∞ with the symmetric convolution operation is a commutative semigroup with the cancellation law for which we discuss the existence of inverses. For p = 1 , a representation of the spectrum in terms of entire functions of exponential type is obtained which allows us to determine the invertible elements.

Discrete mathematicsPower sum symmetric polynomialTriple systemSpectra of algebrasApplied MathematicsSymmetric polynomialsStanley symmetric functionComplete homogeneous symmetric polynomialSymmetric convolutionSymmetric functionEntire functions of exponential typeElementary symmetric polynomialRing of symmetric functionsPolynomials and analytic functions on Banach spacesAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Generalized ``transition probability''

1975

An operationally meaningful symmetric function defined on pairs of states of an arbitrary physical system is constructed and is shown to coincide with the usual “transition probability” in the special case of systems admitting a quantum-mechanical description. It can be used to define a metric in the set of physical states. Conceivable applications to the analysis of certain aspects of Quantum Mechanics and to its possible modifications are mentioned.

Discrete mathematicsPure mathematicsTransition (fiction)Complex systemPhysical systemStatistical and Nonlinear PhysicsSymmetric functionSet (abstract data type)Probability amplitudeMetric (mathematics)Special case81.60Mathematical PhysicsMathematics
researchProduct

Parabolic equations with natural growth approximated by nonlocal equations

2017

In this paper we study several aspects related with solutions of nonlocal problems whose prototype is $$ u_t =\displaystyle \int_{\mathbb{R}^N} J(x-y) \big( u(y,t) -u(x,t) \big) \mathcal G\big( u(y,t) -u(x,t) \big) dy \qquad \mbox{ in } \, \Omega \times (0,T)\,, $$ being $ u (x,t)=0 \mbox{ in } (\mathbb{R}^N\setminus \Omega )\times (0,T)\,$ and $ u(x,0)=u_0 (x) \mbox{ in } \Omega$. We take, as the most important instance, $\mathcal G (s) \sim 1+ \frac{\mu}{2} \frac{s}{1+\mu^2 s^2 }$ with $\mu\in \mathbb{R}$ as well as $u_0 \in L^1 (\Omega)$, $J$ is a smooth symmetric function with compact support and $\Omega$ is either a bounded smooth subset of $\mathbb{R}^N$, with nonlocal Dirichlet bound…

PhysicsKernel (set theory)Applied MathematicsGeneral Mathematics010102 general mathematicsMathematics::Analysis of PDEs01 natural sciencesParabolic partial differential equationOmega010101 applied mathematicsSymmetric functionCombinatoricssymbols.namesakeMathematics - Analysis of PDEsMathematics - Analysis of PDEs; Mathematics - Analysis of PDEsBounded functionDirichlet boundary conditionsymbolsFOS: MathematicsUniqueness0101 mathematicsAnalysis of PDEs (math.AP)
researchProduct

The algebra of symmetric analytic functions on L∞

2017

We consider the algebra of holomorphic functions on L∞ that are symmetric, i.e. that are invariant under composition of the variable with any measure-preserving bijection of [0, 1]. Its spectrum is identified with the collection of scalar sequences such that is bounded and turns to be separable. All this follows from our main result that the subalgebra of symmetric polynomials on L∞ has a natural algebraic basis.

Power sum symmetric polynomialTriple systemGeneral Mathematics010102 general mathematicsSubalgebraStanley symmetric functionComplete homogeneous symmetric polynomial01 natural sciences010101 applied mathematicsAlgebraSymmetric polynomialComputingMethodologies_DOCUMENTANDTEXTPROCESSINGElementary symmetric polynomial0101 mathematicsRing of symmetric functionsMathematicsProceedings of the Royal Society of Edinburgh: Section A Mathematics
researchProduct